Submission to ICALP 2011 Track B ( Topic : Automata Theory , Formal Languages )
نویسنده
چکیده
On every n-long input, every two-way finite automaton (fa) can reverse its head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that requires Ω(2) states on every deterministic fa with few reversals, but only h states on a nondeterministic fa with few reversals.
منابع مشابه
Rational Transformations of Formal Power Series
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve rationality, genera...
متن کاملWork and Publications
s: Some of the original abstracts are reproduced almost without change and some with minor revision. The former cases are indicated by v.o., whereas the latter cases are indicated by rev. Common abbreviations (for the publication items) include: CCC: Annual IEEE Conference on Computational Complexity. COLT: Annual ACM Workshop on Computational Learning Theory. FOCS: Annual IEEE Symposium on Fou...
متن کاملL-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory
We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of alphabets, the definition of orders over alphabet symbols, the partial definition of languages using unit tests, and the definition of mechanisms, which implement language generators or language recognizers. Supported mechanisms include predicates, regular expressions, fini...
متن کاملOn the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between such systems, a generalisation of reduction barbed congru...
متن کاملEmptiness of Zero Automata Is Decidable
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic size and the emptiness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011